Structural properties of recursively partitionable graphs with connectivity 2
نویسندگان
چکیده
منابع مشابه
Structural properties of recursively partitionable graphs with connectivity 2 ∗ Olivier
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, ..., np) of |V (G)| there exists a partition (V1, ..., Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (...
متن کاملStructural properties of recursively partitionable graphs with connectivity 2
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partition...
متن کاملOn the structure of arbitrarily partitionable graphs with given connectivity
A graph G = (V , E) is arbitrarily partitionable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected subgraphs. Such a graph models, e.g., a computer network which may be arbitrarily partitioned into connected subnetworks. In this paper we study the structure of such graphs and...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملstructural properties of fuzzy graphs
matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2017
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1925